DIPS: an efficient pointer swizzling strategy for incremental uncaching environments

Adaptable Pointer Swizzling Strategies in Object Bases

In this paper we will classify and evaluate di erent approaches to optimizing the access to main memory resident persistent objects|techniques which are commonly referred to as \pointer swizzling". To speed up the access along inter-object references, the persistent pointers are transformed (swizzled) into main memory pointers (addresses). We will evaluate four di erent pointer swizzling techni...

A Performance Study of Alternative Object Faulting and Pointer Swizzling Strategies

This paper presents a portable, efficient method for accessing memory resident persistent objects in virtual memory in the context of the E programming language. Under the approach, objects are copied from the buffer pool of the underlying object manager into virtual memory on demand, as they are accessed by an E program. The cumulative effects of updates to a persistent object are then propaga...

E cient Barriers for Persistent Object Caching in a High-Performance Java Virtual Machine

We implemented orthogonal persistence for the Java platform by adding persistent object caching to a high-performance virtual machine that uses exact garbage collection (\EVM"). This paper gives an overview of our design for the read and write barriers needed to support persistence. The key design decision we made was the choice of a pointer swizzling strategy. Pointer swizzling speeds up progr...

An Analysis of Swizzling Costs in an OODBMS

Swizzling is a mechanism used by OODBMSs to convert pointers from their disk formats to a more eecient in-memory format. In this project we analyze the the costs associated with swizzling in Texas, an OODBMS which does pointer swizzling at page-fault time. We report the costs of signal handling, object translation, the virtual memory overhead, and unswizzling. We compare the performance of Texa...

Physical Pointer Swizzling